| contributor |
Charon, Irène
|
| Hudry, Olivier
|
| creator |
Danzart, Annie
|
| date |
2005-12-07
|
| |
| description |
General basics of algorithms:
Formulation of a problem and search for an algorithm
Formalization of an algorithm, notion of complexity
Sequencing of actions and an example of a program in C language
C language:
Structure of a program
Pre-defined types
Evaluation of expressions
Prototyping and definition of functions
Iterative and recursive programming
Definition of types
Pointers and dynamic allocation
E/S: standard and other files ("text" and "binary" files)
Use of graphics
Modules (predefined functions and libraries, construction and use of specific modules)
Data structures, related algorithms: implementation
Lists, queues, stacks:
- Hash code tables
- Graph depictions, etc.
Binary trees:
- Binary search tree
- Huffman coding, etc.
|
| The objectives of this training program are, firstly, acquisition of an efficient programming method and, secondly, the practical use of at least one language. C language has been chosen since it is one of the most widely used scientific languages. Like Pascal, it enables high-level programming (control structures, data types, recursion, etc.) and is well suited to separate compilation.
Students will use workstations during this training program.
|
| Level: Licence 3ème année
|
| Level: Ingénieur 1ère année
|
| Course: Ingénieur
|
| Duration of the course: 32h00
|
| format |
text/html
|
| identifier |
ENST_INF102_LC
|
| language |
en
|
| publisher |
Institut Télécom
|
| rights |
http://formation.enst.fr/licences/pedago_sans.html |